Everything about Moore Machine totally explained
In the
theory of computation, a
Moore machine is a
finite state automaton where the outputs are determined by the current
state alone (and don't depend directly on the input). The
state diagram for a Moore machine will include an output signal for each state. Compare with a
Mealy machine, which maps
transitions in the machine to outputs.
The name
Moore machine comes from that of its promoter,
Edward F. Moore, a state-machine pioneer who wrote "Gedanken-experiments on Sequential Machines".
Most digital electronic systems are designed as
clocked sequential systems. Clocked sequential systems are a restricted form of Moore machine where the state changes only when the global clock signal changes. Typically the current state is stored in
flip-flops, and a global clock signal is connected to the "clock" input of the flip-flops. Clocked sequential systems are one way to solve
metastability problems. A typical electronic Moore machine includes a
combinatorial logic chain to decode the current state into the outputs (lambda). The instant the current state changes, those changes ripple through that chain, and almost instantaneously the outputs change (or don't change). There are design techniques to ensure that no
glitches occur on the outputs during that brief period while those changes are rippling through the chain, but most systems are designed so that glitches during that brief transition time are ignored or are irrelevant. The outputs then stay the same indefinitely (
LEDs stay bright, power stays connected to the motors,
solenoids stay energized, etc.), until the Moore machine changes state again.
Formal definition
A Moore machine can be defined as a
6-tuple + 1 .
Theorems
A and
B were used for the basis of the course work of a student of the fourth year, A.A. Karatsuba,
"On a problem from the automata theory" which was distinguished by testimonial
reference at the competition of student works of the faculty of mechanics and mathematics of Moscow Lomonosow State University in 1958. The paper by A.A. Karatsuba was given to the journal Uspekhi Mat. Nauk on 17 December 1958 and was published there in June 1960
.
Until the present day (2007), Karatsuba's result on the length of experiments is the only exact nonlinear result, both in automata theory, and in similar problems of computational complexity theory.
Further Information
Get more info on 'Moore Machine'.
|
External Link Exchanges
Do you know how hard it is to get a link from a large encyclopaedia? Well we're different and will prove it. To get a link from us just add the following HTML to your site on a relevant page:
<a href="http://moore_machine.totallyexplained.com">Moore machine Totally Explained</a>
Then simply click through this link from your web page. Our crawlers will verify your link, extract the title of your web page and instantly add a link back to it. If you like you can remove the words Totally Explained and embed the link in article text.
As long as your link remains in place, we'll keep our link to you right here. Please play fair - our crawlers are watching. Your site must be closely related to this one's topic. Any kind of spamming, dubious practises or removing the link will result in your link from us being dropped and, potentially, your whole site being banned. |
